A proof of Tutte's realizability condition

Realizability condition for electromagnetic Schell-model sources.

The set of functions that appear in the correlation matrix of an electromagnetic source must satisfy the constraint of nonnegative definiteness. Here we derive a necessary and sufficient condition for nonnegativeness for the class of electromagnetic Schell-model sources. This result also suggests a possible synthesis procedure for this type of source. As an illustration, two specific examples o...

Program Extraction, Simpliied Proof-terms and Realizability

Interpreting a Classical Geometric Proof with Interactive Realizability

We show how to extract a monotonic learning algorithm from a classical proof of a geometric statement by interpreting the proof by means of interactive realizability, a realizability sematics for classical logic. The statement is about the existence of a convex angle including a finite collections of points in the real plane and it is related to the existence of a convex hull. We define real nu...

Non-realizability and Ending Laminations Proof of the Density Conjecture

We give a complete proof of the Bers-Sullivan-Thurston Density Conjecture. In the light of the Ending lamination theorem, it suffices to prove that any collection of possible ending invariants is realized by some algebraic limit of geometrically finite hyperbolic manifolds. The ending invariants are either Riemann surfaces or filling laminations supporting Masur domain measured laminations and ...

Realizability in Cyclic Proof: Extracting Ordering Information for Infinite Descent

In program verification, measures for proving the termination of programs are typically constructed using (notions of size for) the data manipulated by the program. Such data are often described by means of logical formulas. For example, the cyclic proof technique makes use of semantic approximations of inductively defined predicates to construct Fermat-style infinite descent arguments. However...